Efficient FIB caching using minimal non-overlapping prefixes
نویسندگان
چکیده
منابع مشابه
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similarity joins are commonly used to implement this operation; they scale to large datasets and are versatile to represent a variety of similarity notions. Most set similarity join methods proposed so far present two main ph...
متن کاملCatching popular prefixes at AS border routers with a prediction based method
Modern Internet routers require powerful forwarding facilities to cope with extremely high rate Forwarding Information Base (FIB) lookups. In general, the FIB is constrained to a small highly efficient but expensive memory. Unfortunately, the BGP route table (RIB) keeps increasing, and this subsequently results in severe FIB inflation at BGP routers. What if we only load a small portion of the ...
متن کاملCompetitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie
This paper presents an asymptotically optimal online algorithm for compressing the Forwarding Information Base (FIB) of a router under a stream of updates (namely insert rule, delete rule, and change port of prefix). The objective of the algorithm is to dynamically aggregate forwarding rules into a smaller but equivalent set of rules while taking into account FIB update costs. The problem can b...
متن کاملAction Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata
Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of hierarchical-structured component-oriented software systems. However, the rules governing composition, as is typical for all automata-based approaches, suffer from combinatorial state explosion, an effect that can have significant ramifications on the successful application of the Component Inte...
متن کاملThe Number of Prefixes of Minimal Factorisations of a Cycle
We prove in two different ways that the number of prefixes of length k of minimal factorisations of the n-cycle (1 . . . n) as a product of n−1 transpositions is ( n k+1 ) nk−1. Our first proof is not bijective but makes use of a correspondence between minimal factorisations and Cayley trees. The second proof consists in establishing a bijection between the set which we want to enumerate and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCOMM Computer Communication Review
سال: 2013
ISSN: 0146-4833
DOI: 10.1145/2427036.2427039